Why to Use Deductive Technology in SQL Databases?

نویسنده

  • Andreas Behrend
چکیده

The notion of a deductive database has emerged during the s in order to describe database systems capable of inferring new knowledge using rules Within this research area three kinds of rule based extensions for traditional databases have been intensively studied active deductive and normative rules Nowadays even SQL databases use these extensions in form of triggers views and integrity constraints although with quite restricted functionality A uniform approach making these concepts really orthogonal to each other is still missing In this paper we will show how new results in the eld of deductive databases may help to nd a more uniform extension of SQL

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Bridging the Expressiveness Gap Between Relational and Deductive Databases

SQL technology has evolved during last years, and systems are being more powerful and scalable. However, there exist yet some expressiveness limitations that can be otherwise overcome with inputs from deductive databases. This paper focuses on both practical and theoretical expressiveness issues in current SQL implementations that are overcome in the Datalog Educational System (DES), a deductiv...

متن کامل

Declarative Programming and Knowledge Management

Most real-world applications inevitably face the issue of persistence, generally understood as how to design, maintain and interact with a database. The standard approach relies on the mature technology of relational databases, with interaction specified through SQL embedded in the host programming language. Attempts to raise the level of the error-prone interaction code have been in the direct...

متن کامل

Counting solutions to the View Maintenance Problem

We present an incremental evaluation algorithm for materialized views in relational and deductive database systems. The algorithm computes, in an incremental fashion, the changes to the materialized view in response to changes (insertions, deletions, and updates) to the base relations. The view may be deened in SQL or in Datalog, and may use UNION , negation, aggregation (e.g. SUM, MIN), linear...

متن کامل

A Query Construct for Paraconsistent Databases

A data model has recently been developed for representing and manipulating two kinds of uncertain information in databases: incomplete and inconsistent. The model is based on 4-valued relations, called paraconsistent relations, and has already been employed for developing elegant methods for model computation of general deductive databases. Here, we present an SQL-like SELECT statement construc...

متن کامل

FREDDI: A Fuzzy Relational Deductive Database Interface

This paper shows an architecture for Deductive Fuzzy RDBMS which integrates two approaches of fuzzy databases: the relational and the logical ones. It uses the first one to represent and manipulate imprecise information and the second one to obtain intensional information. Besides, it shows how it is possible to use the resources offered by a conventional RDBMS together with a deduction module ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002